Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
نویسندگان
چکیده
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) for handling such many-objective optimization problems is presented. In its basic form, the algorithm is not well suited for the handling of a larger number of objectives. The main reason for this is the decreasing probability of having Pareto-dominated solutions in the initial external population. To overcome this problem, substitute distance assignment schemes are proposed that can replace the crowding distance assignment, which is normally used in NSGA-II. These distances are based on measurement procedures for the highest degree, to which a solution is nearly Pareto-dominated by any other solution: like the number of smaller objectives, the magnitude of all smaller or larger objectives, or a multi-criterion derived from the former ones. For a number of many-objective test problems, all proposed substitute distance assignments resulted into a strongly improved performance of the NSGAII.
منابع مشابه
Pareto Optimization of Two-element Wing Models with Morphing Flap Using Computational Fluid Dynamics, Grouped Method of Data handling Artificial Neural Networks and Genetic Algorithms
A multi-objective optimization (MOO) of two-element wing models with morphing flap by using computational fluid dynamics (CFD) techniques, artificial neural networks (ANN), and non-dominated sorting genetic algorithms (NSGA II), is performed in this paper. At first, the domain is solved numerically in various two-element wing models with morphing flap using CFD techniques and lift (L) and drag ...
متن کاملA knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملAn Improved Adaptive Approach for Elitist Nondominated Sorting Genetic Algorithm for Many-Objective Optimization
NSGA-II and its contemporary EMO algorithms were found to be vulnerable in solving many-objective optimization problems having four or more objectives. It is not surprising that EMO researchers have been concentrating in developing efficient algorithms for manyobjective optimization problems. Recently, authors suggested an extension of NSGA-II (NSGA-III) which is based on the supply of a set of...
متن کاملBi-objective Portfolio Optimization Using a Customized Hybrid NSGA-II Procedure
Bi-objective portfolio optimization for minimizing risk and maximizing expected return has received considerable attention using evolutionary algorithms. Although the problem is a quadratic programming (QP) problem, the practicalities of investment often make the decision variables discontinuous and introduce other complexities. In such circumstances, usual QP solution methodologies can not alw...
متن کامل